Some Multisecret-Sharing Schemes over Finite Fields
نویسندگان
چکیده
منابع مشابه
Linear Threshold Multisecret Sharing Schemes
In a multisecret sharing scheme, several secret values are distributed among a set of n users, and each secret may have a different associated access structure. We consider here information-theoretic secure schemes with multithreshold access structures. Namely, for every subset P of k users there is a secret key that can only be computed when at least t of them put together their secret informa...
متن کاملLinear Multisecret-Sharing Schemes and Error-Correcting Codes
In this paper a characterization of the general relation between linear multisecret-sharing schemes and error-correcting codes is presented. A bridge between linear multisecret-sharing threshold schemes and maximum distance separable codes is set up. The information hierarchy of linear multisecret-sharing schemes is also established. By making use of the bridge several linear multisecret-sharin...
متن کاملOn cyclotomic schemes over finite near-fields
We introduce a concept of cyclotomic association scheme over a finite near-field K. It is proved that any isomorphism of two such nontrivial schemes is induced by a suitable element of the group AGL(V ), where V is the linear space associated with K. A sufficient condition on a cyclotomic scheme C that guarantee the inclusion Aut(C)≤ A L(1,F), where F is a finite field with |K| elements, is given.
متن کاملPartially Homomorphic Encryption Schemes over Finite Fields
Homomorphic encryption scheme enables computation in the encrypted domain, which is of great importance because of its wide and growing range of applications. The main issue with the known fully (or partially) homomorphic encryption schemes is the high computational complexity and large communication cost required for their execution. In this work, we study symmetric partially homomorphic encry...
متن کاملGraphic Multisecret Sharing Schemes with One-Dimensional Cellular Automata
A multi-secret sharing scheme, which is based on one-dimensional reversible cellular automata with memory, allowing any member of a set of participants to share a secret color image with the rest of participants is presented. Moreover, it is also explained that with this scheme, any participant is able to recover all the secret color images if and only if the whole set of participants pools the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2020
ISSN: 2227-7390
DOI: 10.3390/math8050654